Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems Ax=λBx with singular B

نویسنده

  • Joost Rommes
چکیده

In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A−σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of the problems due to the singularity of B. Secondly, if exact solves are not available, Jacobi-Davidson QZ will be presented as a robust method to compute a few specific eigenvalues. Results are illustrated by numerical experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arnoldi and Jacobi - Davidson methods for generalized eigenvalue problems

In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A − σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of ...

متن کامل

Projection Methods for Nonlinear Sparse Eigenvalue Problems

This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.

متن کامل

Unclassified Report: Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis

This report discusses the application of Jacobi-Davidson style methods in electric circuit simulation. Using the generalised eigenvalue problem, which arises from pole-zero analysis, as a starting point, both the JDQR-method and the JDQZ-method are studied. Although the JDQR-method (for the ordinary eigenproblem) and the JDQZ-method (for the generalised eigenproblem) are designed to converge fa...

متن کامل

Locking and Restarting Quadratic Eigenvalue Solvers

This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from nite-element simulations in acoustics. One approach is the shift-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or de-ation of converged eigenvectors (or Schur vect...

متن کامل

Nonlinear Eigenvalue Problems: A Challenge for Modern Eigenvalue Methods

We discuss the state of the art in numerical solution methods for large scale polynomial or rational eigenvalue problems. We present the currently available solution methods such as the Jacobi-Davidson, Arnoldi or the rational Krylov method and analyze their properties. We briefly introduce a new linearization technique and demonstrate how it can be used to improve structure preservation and wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 77  شماره 

صفحات  -

تاریخ انتشار 2008